منابع مشابه
MAXIMAL ALLOCATED BENEFIT AND MINIMAL ALLOCATED COST AND ITS APPLICATION
In this paper, we investigate the problems of consensus-making among institution in stock exchange with multiple criteria for evaluating performance when the players (institutions) are supposed to be egoistic and the score for each criterion for a player is supposed to be a positive score. Each player sticks to his superiority regarding the criteria. This paper introduces the models for computi...
متن کاملMaximal (sequentially) compact topologies
We revisit the known problem whether each compact topology is contained in a maximal compact topology and collect some partial answers to this question. For instance we show that each compact topology is contained in a compact topology in which convergent sequences have unique limits. We also answer a question of D.E. Cameron by showing that each sequentially compact topology is contained in a ...
متن کاملMaximal and Minimal Topologieso
A topological space (X, T) with property R is maximal R (minimal R) if T is a maximal (minimal) element in the set R(X) of all topologies on the set X having property R with the partial ordering of set inclusions. The properties of maximal topologies for compactness, countable compactness, sequential compactness, Bolzano-Weierstrass compactness, and Lindelöf are investigated and the relations b...
متن کاملMinimal and High Order Neural Network Topologies 1 E. Fiesler Minimal and High Order Neural Network Topologies Simtec '93 2
One of the main goals of current neural network research consists in nding the optimal network topology for a given problem. Several methods have been proposed, but a mutual comparison of the resulting topologies remains a problem until proven minimal topologies are found. This paper describes a straightforward method for nding the minimal feed-forward topology for completely deened problems, b...
متن کاملPutting topologies on dp-minimal fields
4. If b ∈ acl(aS), then dp-rk(b/S) ≤ dp-rk(a/S). 5. dp-rk(ab/S) ≤ dp-rk(a/bS) + dp-rk(b/S). We work in a monster model C of a dp-minimal field (i.e., a field of dp-rank 1). “Models” will refer to small elementary substructures M C. We’ll write concatenation multiplicatively and multiplication using ·. We will assume that C is not strongly minimal. One already knows what strongly minimal fields ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1971
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1971-0281142-7